The structure of a 3-connected matroid with a 3-separating set of essential elements
نویسنده
چکیده
An element e of a 3–connected matroid M is essential if neither the deletion nor the contraction of e from M is 3–connected. Tutte’s 1966 Wheels and Whirls Theorem proves that the only 3–connected matroids in which every element is essential are the wheels and whirls. It was proved by Oxley and Wu that if a 3–connected matroid M has a non-essential element, then it has at least two such elements. Moreover, the set of essential elements of M can be partitioned into classes where two elements are in the same class if M has a fan, a maximal partial wheel, containing both. In addition, if M has a fan with 2k or 2k + 1 elements for some k ≥ 2, then M can be obtained by sticking together a (k + 1)–spoked wheel and a certain 3–connected minor of M . In this paper, it is shown how a slight modification of these ideas can be used to describe the structure of a 3–connected matroid M having a 3– separation (A, B) such that every element of A is essential. The motivation for this study derives from a desire to determine when one can remove an element from M so as to both maintain 3–connectedness and preserve one side of the 3–separation.
منابع مشابه
Matroids and Graphs with Few Non-Essential Elements
An essential element of a 3–connected matroid M is one for which neither the deletion nor the contraction is 3–connected. Tutte’s Wheels and Whirls Theorem proves that the only 3–connected matroids in which every element is essential are the wheels and whirls. In an earlier paper, the authors showed that a 3–connected matroid with at least one non-essential element has at least two such element...
متن کاملOn the Structure of 3-connected Matroids and Graphs
An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte’s Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-connected matroids that have some non-essential elements, showing that every such matroid M must have ...
متن کاملObstructions to a binary matroid being graphic
Bixby and Cunningham showed that a 3-connected binary matroid M is graphic if and only if every element belongs to at most two non-separating cocircuits. Likewise, Lemos showed that such a matroid M is graphic if and only if it has exactly r(M) + 1 nonseparating cocircuits. Hence the presence inM of either an element in at least three non-separating cocircuits, or of at least r(M) + 2 non-separ...
متن کاملA Splitter Theorem Relative to a Fixed Basis
A standard matrix representation of a matroid M represents M relative to a fixed basis B, where contracting elements of B and deleting elements of E(M)−B correspond to removing rows and columns of the matrix, while retaining standard form. If M is 3-connected and N is a 3-connected minor of M , it is often desirable to perform such a removal while maintaining both 3-connectivity and the presenc...
متن کاملOn Maintaining Matroid 3-connectivity Relative to a Fixed Basis
We show that for any 3-connected matroid M on a ground set of at least four elements such that M does not contain any 4-element fans, and any basis B of M , there exists a set K ⊆ E(M) of four distinct elements such that for all k ∈ K, si(M/k) is 3-connected whenever k ∈ B, and co(M\k) is 3connected whenever k ∈ E(M) − B. Moreover, we show that if no other elements of E(M)−K satisfy this proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 265 شماره
صفحات -
تاریخ انتشار 2003